Algorithm for Finding Maximal Frequent Sets
نویسندگان
چکیده
Given a set X and a set C of subsets of X, subsets of X covered by k sets in C are called k-frequent. Frequent sets are of interest in large scale data analysis, pattern recognition and data mining. Characterization of maximal kfrequent sets in terms of equivalence relation and partial order is given. A general algorithm for finding maximal k-frequent sets, efficient for wide range of practical applications, is given. AMS Subject Classification: 03E04, 06A07
منابع مشابه
Discovering Maximal Frequent Item set using Association Array and Depth First Search Procedure with Effective Pruning Mechanisms
The first step of association rule mining is finding out all frequent itemsets. Generation of reliable association rules are based on all frequent itemsets found in the first step. Obtaining all frequent itemsets in a large database leads the overall performance in the association rule mining. In this paper, an efficient method for discovering the maximal frequent itemsets is proposed. This met...
متن کاملA Hybrid GeneticMax Algorithm for Improving the Traditional Genetic Based Approach for Mining Maximal Frequent Item Sets
Mining Frequent item sets is one of the most useful data mining methods which discovers important relationships among attributes of data sets. Initially it was developed for market basket analysis, but these days it is used to solve any task where discovering hidden relationships among different attributes is required. Mining frequent item sets plays a vital role for generating association rule...
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملFinding All Maximal Frequent Sequences in Text
In this paper we present a novel algorithm for discovering maximal frequent sequences in a set of documents, i.e., such sequences of words that are frequent in the document collection and, moreover, that are not contained in any other longer frequent sequence. A sequence is considered to be frequent if it appears in at least documents, when is the frequency threshold given. Our approach combine...
متن کاملIncreasing the Efficiency of the Software Architecture Recovery through Spanning Tree Based Maximal Graph Mining Technique
This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed in this context, for example Apriori base...
متن کامل